Conflicting accounts of λ-definability

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computability and λ-Definability

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

The Undecidability of λ-Definability

In this article, we shall show that the Plotkin-Statman conjecture [?, ?] is false. The conjecture was that, in a model of the simply typed λ-calculus with only finitely many elements at each type, definability (by a closed term of the calculus) is decidable. This conjecture had been shown to imply many things, for example, Statman [?] (see also Wolfram’s book [?]) has shown it implies the deci...

متن کامل

Delta1-Definability

Boban Veli ckovi c y Jensen's Coding Theorem provides a method for making a class of ordinals 2-deenable in a real. In this paper we explore the possibility of obtaining a 1-deenition. While this is not possible in general, we show that by assuming enough condensation, a class can be made 1 in a real parameter in a class-generic extension. Our main application is the following. Theorem There is...

متن کامل

Definability of Leibniz Equality

Equality in first-order logic is represented in the language by means of a logical symbol and so it is interpreted uniformly; the semantics says that its interpretation in any structure is the identity relation. This is the absolute notion of identity however, and in fact the only one deserving this name. But there is a related relation: the relation of indiscernibility. Given a structure for a...

متن کامل

Ĝ Ĝ Λ 11 Λ 12 Λ 21 Λ 21 Λ 22 Λ 22 Λ Λ̃ 0 0 Λ̂

In this paper we present an algorithm for pricing barrier options in one-dimensional Markov models. The approach rests on the construction of an approximating continuous-time Markov chain that closely follows the dynamics of the given Markov model. We illustrate the method by implementing it for a range of models, including a local Lévy process and a local volatility jump-diffusion. We also pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming

سال: 2017

ISSN: 2352-2208

DOI: 10.1016/j.jlamp.2016.11.001